Separation Choosability and Dense Bipartite Induced Subgraphs
نویسندگان
چکیده
منابع مشابه
Separation choosability and dense bipartite induced subgraphs
We study a restricted form of list colouring, for which every pair of lists that correspond to adjacent vertices may not share more than one colour. The optimal list size such that a proper list colouring is always possible given this restriction, we call separation choosability. We show for bipartite graphs that separation choosability increases with (the logarithm of) the minimum degree. This...
متن کاملFinding Dense Subgraphs for Sparse Undirected, Directed, and Bipartite Graphs
This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subgraphs are interpreted as communities, as in, e.g., social networks. The problem of identifying dense subgraphs helps analyze graph structures and complex networks and it is known to be challenging. It bears some similarities ...
متن کاملA Local Algorithm for Finding Dense Bipartite-Like Subgraphs
We give a local algorithm to extract dense bipartite-like subgraphs which characterize cyber-communities in the Web [13]. We use the bipartiteness ratio of a set as the quality measure that was introduced by Trevisan [20]. Our algorithm, denoted as FindDenseBipartite(v, s, θ), takes as input a starting vertex v, a volume target s and a bipartiteness ratio parameter θ and outputs an induced subg...
متن کاملBipartite Subgraphs
It is shown that there exists a positive c so that for any large integer m, any graph with 2m 2 edges contains a bipartite subgraph with at least m 2 + m/2 + c √ m edges. This is tight up to the constant c and settles a problem of Erd˝ os. It is also proved that any triangle-free graph with e > 1 edges contains a bipartite subgraph with at least e 2 + c e 4/5 edges for some absolute positive co...
متن کاملChoosability with union separation
List coloring generalizes graph coloring by requiring the color of a vertex to be selected from a list of colors specific to that vertex. One refinement of list coloring, called choosability with separation, requires that the intersection of adjacent lists is sufficiently small. We introduce a new refinement, called choosability with union separation, where we require that the union of adjacent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2019
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548319000026